package com.acwing.partition35;

import java.io.*;

/**
 * @author `RKC`
 * @date 2022/3/15 15:13
 */
public class AC3494国际象棋 {

    private static final int N = 110, M = 6, K = 22, MOD = 1000000007;
    //f[i][cur][prev][k]表示考虑前i行，且当前行状态是cur，上一行的状态是prev，且已经放置k个马的所有集合的合法方案数
    private static int[][][][] f = new int[N][1 << M][1 << M][K];
    private static int n, m, k;

    private static final BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
    private static final BufferedWriter writer = new BufferedWriter(new OutputStreamWriter(System.out));

    public static void main(String[] args) throws IOException {
        String[] ss = reader.readLine().split(" ");
        n = Integer.parseInt(ss[0]);
        m = Integer.parseInt(ss[1]);
        k = Integer.parseInt(ss[2]);
        f[0][0][0][0] = 1;
        for (int i = 1; i <= m; i++) {
            for (int cur = 0; cur < 1 << n; cur++) {
                for (int prev1 = 0; prev1 < 1 << n; prev1++) {
                    if ((cur & (prev1 << 2)) != 0 || (prev1 & (cur << 2)) != 0) continue;
                    for (int prev2 = 0; prev2 < 1 << n; prev2++) {
                        if ((prev1 & (prev2 << 2)) != 0 || (prev2 & (prev1 << 2)) != 0) continue;
                        if ((cur & (prev2 << 1)) != 0 || (prev2 & (cur << 1)) != 0) continue;
                        int cnt = bitCount(cur);
                        for (int u = cnt; u <= k; u++) {
                            f[i][cur][prev1][u] = (f[i][cur][prev1][u] + f[i - 1][prev1][prev2][u - cnt]) % MOD;
                        }
                    }
                }
            }
        }
        int ans = 0;
        for (int i = 0; i < 1 << n; i++) {
            for (int j = 0; j < 1 << n; j++) {
                ans = (ans + f[m][i][j][k]) % MOD;
            }
        }
        writer.write(ans + "\n");
        writer.flush();
    }

    private static int bitCount(int x) {
        int res = 0;
        while (x != 0) {
            res++;
            x -= x & -x;
        }
        return res;
    }
}
